Large Simple Binary Equality Words
نویسندگان
چکیده
Let w be an equality word of two nonperiodic binary morphisms g, h : {a, b}∗ → ∆∗. Suppose that no overflow occurs twice in w and that w contains at least 9 occurrences of a and at least 9 occurrences of b. Then either w = (ab)a, or w = ab with gcd(i, j) = 1, up to the exchange of letters a and b.
منابع مشابه
On Binary Equality Sets and a Solution to the Test Set Conjecture in the Binary Case
K. Culik II and J. Karhumaki [RAZRO Inform. Theor. 14 (1980), 349-3691 conjectured that the equality set of two injective morphisms over a binary alphabet is of the form {u, v)* for some (possibly empty) words u and v. Here we show that such an equality set is always either of the above form or of the form (uw*v)* for some words u, W, and v. As an application we give a simple proof for the Test...
متن کاملBinary Equality Words for Periodic Morphisms
Let g and h be binary morphisms defined on {a, b}∗, and let g be periodic and h nonperiodic. It is well known that their equality language is generated by at most one nonempty word. Suppose |h(b)| ≥ |h(a)|. We show that then the equality word is equal to aba , with i, j ≥ 0. Binary equality sets are the simplest nontrivial equality languages. Nevertheless, their full description is still not kn...
متن کاملA particle swarm optimization method for periodic vehicle routing problem with pickup and delivery in transportation
In this article, multiple-product PVRP with pickup and delivery that is used widely in goods distribution or other service companies, especially by railways, was introduced. A mathematical formulation was provided for this problem. Each product had a set of vehicles which could carry the product and pickup and delivery could simultaneously occur. To solve the problem, two meta-heuristic methods...
متن کاملA Unique Structure of Two-Generated Binary Equality Sets
Let L be the equality set of two distinct injective morphisms g and h, and let L be generated by at least two words. Recently it was proved ([2]) that such an L is generated by two words and g and h can be chosen marked from both sides. We use this result to show that L is of the form {ab, ba}, with i ≥ 1.
متن کاملAverage-case Analysis of Equality of Binary Trees Under the BST Probability Model
In this paper a simple algorithm to test equality of binary trees currently used in symbolic computation, uniication, etc. is investigated. Surprisingly enough, it takes O(1) steps on average to decide if a given pair of trees of total size n are equal or not if the uniform probability model for the input is assumed. Moreover, other similar algorithms have qualitatively the same average complex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Int. J. Found. Comput. Sci.
دوره 23 شماره
صفحات -
تاریخ انتشار 2008